The Word Problem of $\mathbb{Z}^n$ Is a Multiple Context-Free Language

نویسنده

  • Meng-CheTurboHo
چکیده

The word problem of a group G = Σ can be defined as the set of formal words in Σ * that represent the identity in G. When viewed as formal languages, this gives a strong connection between classes of groups and classes of formal languages. For example, Anisimov [An¯ ı71] showed that a group is finite if and only if its word problem is a regular language, and Muller and Schupp [MS83] showed that a group is virtually-free if and only if its word problem is a context-free language. Above this, not much was known, until Salvati [Sal15] showed recently that the word problem of Z 2 is multiple context-free, giving first such example. We generalize Salvati's result to show that the word problem of Z n is a multiple context-free language for any n.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

An explicit formula for the number of fuzzy subgroups of a finite abelian $p$-group\ of rank two

Ngcibi, Murali and Makamba [Fuzzy subgroups of rank two abelian$p$-group, Iranian J. of Fuzzy Systems {bf 7} (2010), 149-153]considered the number of fuzzy subgroups of a finite abelian$p$-group $mathbb{Z}_{p^m}times mathbb{Z}_{p^n}$ of rank two, andgave explicit formulas for the cases when $m$ is any positiveinteger and $n=1,2,3$. Even though their method can be used for thecases when $n=4,5,l...

متن کامل

Studying impressive parameters on the performance of Persian probabilistic context free grammar parser

In linguistics, a tree bank is a parsed text corpus that annotates syntactic or semantic sentence structure. The exploitation of tree bank data has been important ever since the first large-scale tree bank, The Penn Treebank, was published. However, although originating in computational linguistics, the value of tree bank is becoming more widely appreciated in linguistics research as a whole. F...

متن کامل

ON THE GROUPS WITH THE PARTICULAR NON-COMMUTING GRAPHS

Let $G$ be a non-abelian finite group. In this paper, we prove that $Gamma(G)$ is $K_4$-free if and only if $G cong A times P$, where $A$ is an abelian group, $P$ is a $2$-group and $G/Z(G) cong mathbb{ Z}_2 times mathbb{Z}_2$. Also, we show that $Gamma(G)$ is $K_{1,3}$-free if and only if $G cong {mathbb{S}}_3,~D_8$ or $Q_8$.

متن کامل

SOLVABILITY OF FREE PRODUCTS, CAYLEY GRAPHS AND COMPLEXES

In this paper, we verify the solvability of free product of finite cyclic groups with topological methods. We use Cayley graphs and Everitt methods to construct suitable 2-complexes corresponding to the presentations of groups and their commutator subgroups. In particular, using these methods, we prove that the commutator subgroup of $mathbb{Z}_{m}*mathbb{Z}_{n}$ is free of rank $(m-1)(n-1)$ fo...

متن کامل

A two-phase free boundary problem for a semilinear elliptic equation

In this paper we study a two-phase free boundary problem for a semilinear elliptic equation on a bounded domain $Dsubset mathbb{R}^{n}$ with smooth boundary‎. ‎We give some results on the growth of solutions and characterize the free boundary points in terms of homogeneous harmonic polynomials using a fundamental result of Caffarelli and Friedman regarding the representation of functions whose ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017